Propagating Updates in Real-Time Search: HLRTA*(k)
نویسندگان
چکیده
We enhance real-time search algorithms with bounded propagation of heuristic changes. When the heuristic of the current state is updated, this change is propagated consistently up to k states. Applying this idea to HLRTA*, we have developed the new HLRTA*(k) algorithm, which shows a clear performance improvement over HLRTA*. Experimentally, HLRTA*(k) converges in less trials than LRTA*(k), while the contrary was true for these algorithms without propagation. We provide empirical results showing the benefits of our approach.
منابع مشابه
Improving HLRTA*( k )
Real-time search methods allow an agent to move in unknown environments. We provide two enhancements to the real-time search algorithm HLRTA*(k). First, we give a better way to perform bounded propagation, generating the HLRTA*LS(k) algorithm. Second, we consider the option of doing more than one action per planning step, by analyzing the quality of the heuristic found during lookahead, produci...
متن کاملCombining Two Fast-Learning Real-Time Search Algorithms Yields Even Faster Learning
Real-time search methods, such as LRTA*, have been used to solve a wide variety of planning problems because they can make decisions fast and still converge to a minimum-cost plan if they solve the same planning task repeatedly. In this paper, we perform an empirical evaluation of two existing variants of LRTA* that were developed to speed up its convergence, namely HLRTA* and FALCONS. Our expe...
متن کاملImproving Convergence of LRTA*(k)
LRTA* is a real-time heuristic search algorithm widely used. In each iteration it updates the heuristic estimate of the current state. In this paper, we present three versions of LRTA*(k), a new LRTA*based algorithm that is able to update the heuristic estimates of up to k states, not necessarily distinct. Based on bounded propagation, this updating strategy maintains heuristic admissibility, s...
متن کاملA novel local search method for microaggregation
In this paper, we propose an effective microaggregation algorithm to produce a more useful protected data for publishing. Microaggregation is mapped to a clustering problem with known minimum and maximum group size constraints. In this scheme, the goal is to cluster n records into groups of at least k and at most 2k_1 records, such that the sum of the within-group squ...
متن کاملPrioritized-LRTA*: Speeding Up Learning via Prioritized Updates
Modern computer games demand real-time simultaneous control of multiple agents. Learning real-time search, which interleaves planning and acting, allows agents to both learn from experience and respond quickly. Such algorithms require no prior knowledge of the environment and can be deployed without pre-processing. We introduce PrioritizedLRTA*, an algorithm based on Prioritized Sweeping. This ...
متن کامل